A Three-Valued Semantics for Typed Logic Programming
نویسندگان
چکیده
منابع مشابه
A three-valued semantics for logic programmers
This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer’s interpretation of a program), procedural semantics (for example, SLD resolution) and fixpoint semantics (which is useful for program analysis and alt...
متن کاملThree-Valued Semantics for Extended Logic Programs
In 4] , the semantics of monotonic (i.e. not-free) extended logic programs (ELPs) has been rephrased in three-valued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and many-valued logics. In this paper, we generalize this approach to unrestricted ELPs. We obtain a unifying view of many formalis...
متن کاملProgramming in Three-valued Logic
The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...
متن کاملLogic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene’s strong three-valued logic with complete equivalence and Fitting’s associated immediate consequence operator is used. However, in such a logic the least fixed point of the Fitting operator is not necessarily a model for the program under consideration. Moreover, the model intersection property does not hold. In this...
متن کاملA Declarative Semantics for Typed Logic Programs
Many typed (sorted) logic programming languages are based on sorted logics in which there is typically a set of well-sortedness rules in addition to the ordinary well-formedness rules. An advantage of this approach is that type checking is typically decidable. However such an approach restricts the expressiveness of typed logic programming language. On the other hand, there is another approach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.306.10